Power-Similarity: Summary of First Results

نویسنده

  • Gary H. Meisters
چکیده

Around 1960, Markus & Yamabe [1] conjectured that, for each n ≥ 2, every rest point x0 of a nonlinear, class C1, n-dimensional system of differential equations ẋ = F (x) is globally asymptotically stable if the eigenvalues of the jacobian matrix F (x) have negative real parts at every point x in R. At that time, Olech [2] connected this problem with the question of injectivity of the mapping x 7→ F (x). An older question, evidently first raised by Keller [3] in 1939 for polynomials over the integers but now also raised for complex polynomials, and, as such, known as “The Jacobian Conjecture” (JC), asks whether polynomial maps F (x) with nonzero constant jacobian determinant det F (x) need be injective (and also surjective with polynomial inverse). It suffices to prove injectivity because in 1960–62 it was proved, first in dimension 2 by Newman [4] and then in all dimensions by Bia lynicki-Birula and Rosenlicht [5], that, for polynomial maps, surjectivity follows from injectivity; and furthermore, under the hypothesis det F (x) = const 6= 0, the inverse F(x) will be polynomial, at least in the complex case, if the polynomial map is bijective. About 1980 it was shown by Bass, Connell, and Wright [6], and also by Yagzhev [7], that to prove JC in every dimension n ≥ 2 it suffices to prove it (but also in every dimension n ≥ 2) for the special case of maps of the form F (x) = x−H(x), where H(x) is homogeneous of degree three. Using this “Reduction of Degree” result, it is easy to show that the truth of the Markus-Yamabe Conjecture implies the truth of JC: For suppose that, in some dimension n, there is a mapping F (x) :≡ x − H(x) that is not injective, where H(tx) ≡ tH(x) and H (x) ≡ 0. (This nilpotence of H (x) is equivalent to Keller’s condition that F (x) have a nonzero constant jacobian determinant. For a proof, see e.g., [8, Lemma 1(c)].) Then F (x1) = F (x2) for some x1 6= x2 in C. So, by the Markus-Yamabe Conjecture, both x1 and x2 are globally asymptotic rest points of the system

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Hybrid Summarization

One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...

متن کامل

بررسی نقش انواع بافتار هم‌نویسه‌ها در تعیین شباهت بین مدارک

Aim: Automatic information retrieval is based on the assumption that texts contain content or structural elements that can be used in word sense disambiguation and thereby improving the effectiveness of the results retrieved. Homographs are among the words requiring sense disambiguation. Depending on their roles and positions in texts, homograph contexts could be divided to different types, wit...

متن کامل

THE IMPACT OF TEACHING SUMMARIZING ON EFL LEARNERS’ MICROGENETIC DEVELOPMENT OF SUMMARY WRITING

Summary writing is associated with lots of cognitive and metacognitive complexities that necessitates instruction (Hirvela & Du, 2013). Contrary to majority of studies carried out on summarization instruction, the present study addressed the underlying processes or microgenetic developments of the Iranian EFL learners’ summary writing. To this end, 41 male and female undergraduate students rece...

متن کامل

Content based Sentence Ordering using Spanning Tree Algorithm for Improved Multi Document Summarization

Due to the availability of required information in the web, as multiple documents, the need for summarizing these multiple documents and ordering of the sentences in the summary in an efficient way become a relevant task in data mining. We present a novel sentence ordering method based on maximum cost spanning tree algorithm to improve the readability and cohesion of the summary obtained by ext...

متن کامل

Formal and functional assessment of the pyramid method for summary content evaluation

Pyramid annotation makes it possible to evaluate quantitatively and qualitatively the content of machine-generated (or human) summaries. Evaluation methods must prove themselves against the same measuring stick – evaluation – as other research methods. First, a formal assessment of pyramid data from the 2003 Document Understanding Conference (DUC) is presented; this addresses whether the form o...

متن کامل

Summarizing with Roget's and with FrameNet

We submitted runs from two different systems for the update summary task at TAC 2009. The first system refined its use of Roget’s Thesaurus, moving beyond 2008’s semantic relatedness to compute an entropy-based uniqueness measure, with improved results in summary construction. The other system, our first use of deeper semantic knowledge, represents sentences as FrameNet types in a conceptual gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004